On the Additive Bases Problem in Finite Fields
نویسندگان
چکیده
We prove that if G is an Abelian group and A1, . . . , Ak ⊆ G satisfy mAi = G (the m-fold sumset), then A1 + · · · + Ak = G provided that k > cm log log |G|. This generalizes a result of Alon, Linial, and Meshulam [Additive bases of vector spaces over prime fields. J. Combin. Theory Ser. A, 57(2):203–210, 1991] regarding so-called additive bases.
منابع مشابه
Waring’s Problem with Digital Restrictions
We present a generalization of a result due to Thuswaldner and Tichy to the ring of polynomials over a finite fields. In particular we want to show that every polynomial of sufficiently large degree can be represented as sum of k-th powers, where the bases evaluated on additive functions meet certain congruence restrictions.
متن کاملWARING’S PROBLEM WITH DIGITAL RESTRICTIONS IN Fq[X]
We present a generalization of a result due to Thuswaldner and Tichy to the ring of polynomials over a finite fields. In particular we want to show that every polynomial of sufficiently large degree can be represented as sum of k-th powers, where the bases evaluated on additive functions meet certain congruence restrictions.
متن کاملAdditive Bases and Extremal Problems in Groups, Graphs and Networks
Bases in sets and groups and their extremal problems have been studied in additive number theory such as the postage stamp problem. On the other hand, Cayley graphs based on specific finite groups have been studied in algebraic graph theory and applied to construct efficient communication networks such as circulant networks with minimum diameter (or transmission delay). In this paper we establi...
متن کاملAdditive Energy and the Falconer Distance Problem in Finite Fields
We study the number of the vectors determined by two sets in d-dimensional vector spaces over finite fields. We observe that the lower bound of cardinality for the set of vectors can be given in view of an additive energy or the decay of the Fourier transform on given sets. As an application of our observation, we find sufficient conditions on sets where the Falconer distance conjecture for fin...
متن کاملFactoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
The deterministic factorization algorithm for polynomials over finite fields that was recently introduced by the author is based on a new type of linearization of the factorization problem. The main ingredients are differential equations in rational function fields and normal bases of field extensions. For finite fields of characteristic 2, it is known that this algorithm has several advantages...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 23 شماره
صفحات -
تاریخ انتشار 2016